Ibundle: an Eecient Ascending Price Bundle Auction
نویسنده
چکیده
Standard auction mechanisms often break down in important e-commerce applications, where agents demand bundles of complementary resources, i.e. \I only want B if I also get A". This paper describes iBundle, an ascending-price auction that is guaranteed to compute optimal bundle allocations with agents that follow a best-response bidding strategy. The auction prices bundles directly and allows agents to place additive or exclusive-or bids over collections of bundles. Empirical results connrm that iBundle generates ee-cient allocations for hard resource allocation problems. Furthermore , we show that iBundle generates solutions without complete revelation (or computation) of agent preferences.
منابع مشابه
An Ascending-Price Generalized Vickrey Auction
A simple characterization of the equilibrium conditions required to compute Vickrey payments in the Combinatorial Allocation Problem leads to an ascending price Generalized Vickrey Auction. The ascending auction, iBundle Extend & Adjust (iBEA), maintains non-linear and perhaps non-anonymous prices on bundles of items, and terminates with the efficient allocation and the Vickrey payments in ex p...
متن کاملAn Efficient and Incentive Compatible Ascending Auction for Multiple Complements1
This paper proposes an ascending-bid auction for efficiently allocating multiple complementary indivisible commodities. The seller has a reserve price for every bundle of goods and determines the quantity for sale based upon bidders’ reported demands. The auctioneer announces a price for every bundle of goods, every bidder subsequently responds with a set of goods demanded at these prices, and ...
متن کاملAn Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions
Combinatorial auctions are used for the efficient allocation of heterogeneous goods and services. They require appropriate software platforms providing automated winner determination and decision support for bidders. Several promising ascending combinatorial auction formats have been developed throughout the past few years based on primal-dual algorithms and linear programming theory. The Ascen...
متن کاملEffects of Suboptimal Bidding in Combinatorial Auctions
Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auction designs. Several promising ascending auction formats have been developed throughout the past few years based on primal-dual and subgradient algorithms and linear programming theory. Prices are interpreted as a feasible dual solution and th...
متن کاملA New Strategy-Proof Greedy-Allocation Combinatorial Auction Protocol and Its Extension to Open Ascending Auction Protocol
This paper proposes a new combinatorial auction protocol called Average-Max-Minimal-Bundle (AM-MB) protocol. The characteristics of the AM-MB protocol are as follows: (i) it is strategyproof, i.e., truth-telling is a dominant strategy, (ii) the computational overhead is very low, since it allocates bundles greedily thereby avoiding an explicit combinatorial optimization problem, and (iii) it ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999